Specifying Database Updates Using A Subschema
نویسندگان
چکیده
The notion of a subschema, as a formal and abstract definition of data, constraints, and database update activities that are needed to make a transaction program, is introduced in the paper. Subschema is a component of a transaction program specification. It is designed using a user request and an existing relational database schema. The principles of a database update using subschema concepts are introduced at the abstraction level of instances to express the fact that a subschema and the corresponding database schema must satisfy certain conditions to allow safe database updates using a program made in accordance with subschema concepts. The conditions of the formal subschema and database schema consistency are introduced at the schema abstraction level, as well. It is shown that formal consistency implies database update principles, which leads to the conclusion that a subschema design process should adhere to formal consistency conditions if it is to constitute a component of a transaction program specification.
منابع مشابه
A Methodology of A Database Schema Design Using The Subschemas
The initial assumption is that a database schema is produced by the integration of simultaneously and independently designed subschemas. The notion of a subschema is defined using the concepts of the relational data model, according to the appropriate external schema, which is used to express a user view onto a future database, on the conceptual level. The process of simultaneous design of subs...
متن کاملA Semantical Notion of Relevance in Speciications of Database Updates and Its Computational Counterpart
Using the situation calculus as underlying formalism for specifying database updates as proposed by Raymond Reiter, a semantical notion of relevance of entries in tables to other entries is introduced. Also a semantical notion of relevant action is provided. Some properties of these semantical notions are investigated. In particular, they are compared with syntactical deenitions of relevance th...
متن کاملTractable database design and datalog abduction through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decomposition algorithms may continue further decomposing a relation even though it is already in 3NF. In this paper we study database design problems whose sets of functional highly parallelizable algorithms for a number of c...
متن کاملXml-based Data Exchange in the Heterogeneous Databases (xdehd)
While the world is witnessing an information revolution unprecedented and great speed in the growth of databases in all aspects. Databases interconnect with their content and schema but use different elements and structures to express the same concepts and relations, which may cause semantic and structural conflicts. This paper proposes a new technique for integration the heterogeneous eXtensib...
متن کاملEfficient Maintenance of Continuous Queries for Trajectories
We address the problem of optimizing the maintenance of continuous queries in Moving Objects Databases, when a set of pending continuous queries need to be reevaluated as a result of bulk updates to the trajectories of moving objects. Such bulk updates may happen when traffic abnormalities, e.g., accidents or road works, affect a subset of trajectories in the corresponding regions, throughout t...
متن کامل